x
uploads/open list.jpg

open list 船員名冊。

open market policy

When we repeat this process for all 4 of the adjacent squares already on the open list , we find that none of the paths are improved by going through the current square , so we don ' t change anything 當我們對已經存在于開放列表的所有4個相鄰方塊都重復這個過程,我們發現經由當前方塊沒有更佳的路徑,所以什么也不用改變。

The other four squares are already on the open list , so we need to check if the paths to those squares are any better using this square to get there , using g scores as our point of reference 其它4個已經在開放列表中了,所以我們需要檢查經由當前方塊到達他們是否是更優的路徑,使用g值為參考點。

Ignoring those that are on the closed list or unwalkable ( terrain with walls , water , or other illegal terrain ) , add squares to the open list if they are not on the open list already 忽略封閉列表內的和不可行走的(墻,水及其它非法地形)方塊,如果方塊不在開放列表中,則添加進去。

Drop the starting square a from your open list , and add it to a “ closed list “ of squares that you don ' t need to look at again for now 把開始方塊a從開放列表中取出,并放到“封閉列表”內,它是所有現在不需要再關注的方塊的列表。

The other two squares below the current square aren ' t already on the open list , so we add them and the current square becomes their parent 當前方塊下的兩個方塊不在開放列表中,所以要添加他們,并把當前方塊作為它們的父親。

Next , we choose one of the adjacent squares on the open list and more or less repeat the earlier process , as described below 下一步,我們從開放列表中,選出一個相鄰的方塊,然后多多少少重復早先的過程,下面會說到。

Instead of using adjacent squares , you would simply look up the adjacent countries in the table when adding new items to your open list 當添加新項目到開放列表中時,你將簡單的查找表中的國家,而不是鄰近的方塊。

We repeat this process until we add the target square to the open list , at which point it looks something like the illustration below 我們重復這個過程,直到把目標點添加到開放列表,此時的情形如下圖所示。

All of the adjacent squares are now on the open list of squares to be checked , and they are outlined in light green 所有的相鄰方塊現在都進入要檢查的方塊的開放列表中了,它們有淺綠的外框。

Our path is generated by repeatedly going through our open list and choosing the square with the lowest f score 我們需要的路徑是這樣生成的:反復的遍歷開放列表,選擇具有最小f值的方塊。

If an adjacent square is already on the open list , check to see if this path to that square is a better one 如果一個相鄰方塊已經存在于開放列表,檢查到達那個方塊的路徑是否更優。

Maintaining the open list : this is actually one of the most time consuming elements of the a * pathfinding function 維護開放列表:實際上這是a *尋路函數最耗費時間的元素之一。

Fail to find the target square , and the open list is empty . in this case , there is no path 沒有找到目標方塊,并且開放列表是空的。此時,沒有路徑。

Every time you access the open list , you need to find the square that has the lowest f cost 每次訪問開放列表時,你都需要找到具有最小f值的方塊。

Begin at the starting point a and add it to an “ open list “ of squares to be considered 從開始點a起,添加它到待考慮的方塊的“開放列表” 。

So we ' re done and ready to check the next square on our open list 所以處理完畢,并準備檢查開放列表中的下一個方塊。

Add them to the open list , too 也把它們添加到開放列表。

Li > drop it from the open list and add it to the closed list 將他從開放列表取出,并加入封閉列表。

Drop it from the open list and add it to the closed list 將他從開放列表取出,并加入封閉列表。